Heuristic Probe Mining Based on Multiple Sequence Analysis
نویسندگان
چکیده
Figure 1: The procedures of the proposed method. In the technology of DNA chips and cDNA microarrays, there is a great deal of studies on composing oligo DNA on the DNA chip and the cDNA microarray by the present situation, but there are a few studies on designing oligo DNA sequences, which are fixed on the DNA chip and the cDNA microarray [4]. Probe design is the essential procedure for high-throughput research such as the oligonucleotide chip, sequencing by hybridization, and etc. The PCR technology, including RT-PCR and Multiplex PCR, is one of the most important techniques in molecular biology. Therefore it is also highly desired to develop a method of PCR primer design for successful experiments. There are a lot of studies for PCR primer design [5]. And Kurata and Nakmura presented primer/probe design method suitable to whole genome experiment [3]. However, it is difficult to apply the existing method to design both genusand speciesspecific probe at a time. This paper shows the heuristic method to extract two kind of probes from the MSA(multiple sequence analysis) result of target sequences. The first kind of probes is for detecting conserved regions and the other is for sequence specific regions. The results are compared with probes of commercial oligo DNA chip which can identify 21 Mycobacteria species.
منابع مشابه
A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملOpen pit limit optimization using dijkstra’s algorithm
In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...
متن کاملa swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...
متن کاملMeta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کامل